Planar graphs

Results: 475



#Item
191

3-choosability of triangle-free planar graphs with constraint on 4-cycles∗ Zdenˇek Dvoˇra´k† Bernard Lidick´ y‡

Add to Reading List

Source URL: iti.mff.cuni.cz

Language: English - Date: 2016-02-04 05:53:37
    192

    Discrete Applied Mathematics–2278 www.elsevier.com/locate/dam Partition into cliques for cubic graphs: Planar case, complexity and approximationI M.R. Cerioli a,b , L. Faria c , T.O. Ferreira b , C.A.J.

    Add to Reading List

    Source URL: cgm.cs.mcgill.ca

    Language: English - Date: 2008-11-07 17:41:16
      193

      3-choosability of planar graphs with (≤ 4)-cycles far apart Zdeněk Dvořák∗ Abstract A graph is k-choosable if it can be colored whenever every vertex

      Add to Reading List

      Source URL: iti.mff.cuni.cz

      Language: English - Date: 2016-02-04 05:53:38
        194

        Three-coloring triangle-free planar graphs in linear time∗ Zdenˇek Dvoˇr´ak† Ken-ichi Kawarabayashi‡ Robin Thomas§

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:37
          195Mathematics / Graph theory / Elementary geometry / Graph connectivity / Combinatorial optimization / Graph operations / Planar graphs / Dual graph / Graph / Line segment / Cut / Bridge

          Convex Partitions with 2-Edge Connected Dual Graphs Marwan Al-Jubeh∗ Michael Hoffmann† Diane L. Souvaine∗

          Add to Reading List

          Source URL: www.cs.rpi.edu

          Language: English - Date: 2008-10-16 18:10:22
          196Graph theory / Mathematics / Discrete mathematics / Graph / Degree / Connectivity / Planar separator theorem / Centrality

          PROTEAN GRAPHS WITH A VARIETY OF RANKING SCHEMES JEANNETTE JANSSEN AND PAWEÃL PRAÃLAT Abstract. We introduce a new class of random graph models for complex realworld networks, based on the protean graph model by L Ã u

          Add to Reading List

          Source URL: www.mathstat.dal.ca

          Language: English - Date: 2010-03-02 15:58:00
          197Graph theory / Graph / Degree / Clique / Ear decomposition / Vertex / Connectivity / Line graph / Planar separator theorem

          Injecting Uncertainty in Graphs for Identity Obfuscation Paolo Boldi Francesco Bonchi Aristides Gionis Tamir Tassa Universita` degli Studi Milano, Italy Yahoo! Research

          Add to Reading List

          Source URL: vldb.org

          Language: English - Date: 2012-07-27 13:07:38
          198

          On Universal Point Sets for Planar Graphs Jean Cardinal Michael Hoffmann ETH Zürich ULB

          Add to Reading List

          Source URL: vincentkusters.org

          Language: English
            199

            Eur. Phys. J. B 71, 259–DOI: epjb/e2009Random planar graphs and the London street network A.P. Masucci, D. Smith, A. Crooks and M. Batty

            Add to Reading List

            Source URL: www.complexcity.info

            Language: English - Date: 2011-07-27 13:35:09
              200

              List Colouring Squares of Planar Graphs Fr´ed´eric Havet 1 , Jan van den Heuvel 2 , Colin McDiarmid 3 ,

              Add to Reading List

              Source URL: www.cdam.lse.ac.uk

              Language: English - Date: 2008-07-21 06:25:53
                UPDATE